The Stereo matching problem
According to the taxonomy proposed in [1] most stereo algorithms
(subset of) these steps:
1) Matching cost computation
2) Cost aggregation
3) Disparity computation/optimization
4) Disparity refinement
Local algorithms perform:
1 => 2 =>3 (with a simple Winner Takes All (WTA) strategy)
Global Algorithms perform:
1 (=>2) =>3 (with global or semi-global reasoning)